Breadth-First Search

QUIZ QUESTION: :

On which steps of its search would the BFS algorithm reach the nodes labelled A, B, and C?

ANSWER CHOICES:

A

B

C

Node	Exploration Order
17
26
23
22
27
33

SOLUTION:

Node	Exploration Order
23	A
22	C
27	B

Is the breadth-first search algorithm complete? Optimal? Efficient?

Complete

Optimal

Efficient

Neither

SOLUTION:

• Complete
• Optimal